Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
نویسندگان
چکیده
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum number of consecutive occurrences of the same symbol). We show that LCS is NP-complete even when restricted to (i) alphabets of size 3 and run-length at most 1, and (ii) alphabets of size 2 and run-length at most 2 (both results are tight). For the latter case, we show that the problem is approximable within ratio 3/5.
منابع مشابه
Deposition and Extension Approach to Find Longest Common Subsequence for Multiple Sequences
The problem of finding the longest common subsequence (LCS) for a set of sequences is a very interesting and challenging problem in computer science. This problem is NPcomplete, but because of its importance, many heuristic algorithms have been proposed, such as Long Run algorithm and Expansion algorithm. However, the performance of many current heuristic algorithms deteriorates fast when the n...
متن کاملThe Longest Common Subsequence Problem forArc -
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arc-preserving common subsequence problem has been introduced in 6, 7] as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures and present some new algorithmic and complexit...
متن کاملThe Longest Common Subsequence Problem
Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructin...
متن کاملVariants of Constrained Longest Common Subsequence
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet Σ, a set Cs of strings, and a function Co : Σ → N , the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that t...
متن کاملEfficient Polynomial-Time Algorithms for Variants of the Multiple Constrained LCS Problem
In this paper, we revisit a recent variant of the longest common subsequence problem, the string-excluding constrained LCS (STR-EC-LCS) problem, which was first addressed by Chen and Chao [Journal of Combinatorial Optimization, 21(3), 2011]. Given two sequences X and Y of lengths n and m, respectively, and a constraint string P of length r, we are to find a common subsequence Z of X and Y which...
متن کامل